Polynomial solvability of cost-based abduction
نویسندگان
چکیده
منابع مشابه
Polynomial Solvability of Cost-Based Abduction
In recent empirical studies we have shown that many interesting cost-based abduction problems can be solved efficiently by considering the linear program relaxation of their integer program formulation. We tie this to the concept of total unimodularity from network flow analysis, a fundamental result in polynomial solvability. From this, we can determine the polynomial solvability of abduction ...
متن کاملPolynomial Solvability of Cost - BasedAbduction 1
Recent empirical 9, 2] studies have shown that many interesting cost-based abduction problems can be solved eeciently by considering the linear program relaxation of their integer program formulation. We tie this to the concept of total unimodularity from network ow analysis, a fundamental result in polynomial solvability. From this, we can determine the polynomial solvability of abduction prob...
متن کاملLogic-Based Abduction New Polynomial Classes for Logic-Based Abduction
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given propositional knowledge base. We give a general algorithm, based on the notion of projection; then we study restrictions over the representations of the knowledge base and of the query, and find new polynomial classes of ...
متن کاملNew Polynomial Classes for Logic-Based Abduction
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given propositional knowledge base. We give a general algorithm, based on the notion of projection; then we study restrictions over the representations of the knowledge base and of the query, and find new polynomial classes of ...
متن کاملProbabilistic Semantics for Cost Based Abduction
Cost-based abduction attempts to find the best explanation for a set of facts by finding a minimal cost proof for the facts. The costs are computed by summing the costs of the assumptions necessary for the proof plus the cost of the rules. We examine existing methods for constructing explanations (proofs), as a minimization problem on a DAG. We then define a probabilistic semantics for the cost...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1996
ISSN: 0004-3702
DOI: 10.1016/0004-3702(96)00016-1